Dictionary Learning Algorithms for Sparse Representation
نویسندگان
چکیده
منابع مشابه
Dictionary Learning Algorithms for Sparse Representation
Algorithms for data-driven learning of domain-specific overcomplete dictionaries are developed to obtain maximum likelihood and maximum a posteriori dictionary estimates based on the use of Bayesian models with concave/Schur-concave (CSC) negative log priors. Such priors are appropriate for obtaining sparse representations of environmental signals within an appropriately chosen (environmentally...
متن کاملEvaluating Dictionary Learning for Sparse Representation Algorithms using SMALLbox
SMALLbox is an open source MATLAB toolbox aiming at becoming a testing ground for the exploration of new provably good methods to obtain inherently data-driven sparse models, which are able to cope with large-scale and complicated data. I. SMALLBOX EVALUATION FRAMEWORK The field of sparse representations has gained a huge interest in recent years, in particular in applications such as compresse...
متن کاملAccelerated Dictionary Learning for Sparse Signal Representation
Learning sparsifying dictionaries from a set of training signals has been shown to have much better performance than pre-designed dictionaries in many signal processing tasks, including image enhancement. To this aim, numerous practical dictionary learning (DL) algorithms have been proposed over the last decade. This paper introduces an accelerated DL algorithm based on iterative proximal metho...
متن کاملIncrementally Built Dictionary Learning for Sparse Representation
Extracting sparse representations with Dictionary Learning (DL) methods has led to interesting image and speech recognition results. DL has recently been extended to supervised learning (SDL) by using the dictionary for feature extraction and classification. One challenge with SDL is imposing diversity for extracting more discriminative features. To this end, we propose Incrementally Built Dict...
متن کاملGreedy algorithms for Sparse Dictionary Learning
Background. Sparse dictionary learning is a kind of representation learning where we express the data as a sparse linear combination of an overcomplete basis set. This is usually formulated as an optimization problem which is known to be NP-Hard. A typical solution uses a two-step iterative procedure which involves either a convex relaxation or some clustering based solution. One problem with t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neural Computation
سال: 2003
ISSN: 0899-7667,1530-888X
DOI: 10.1162/089976603762552951